public class Solution4 {
    //1567. 乘积为正数的最长子数组长度
    public int getMaxLen(int[] nums) {
        int n = nums.length;
        int[] f = new int[n+1]; //以i结尾的乘积最大的子数组
        int[] g = new int[n+1]; //以i结尾的乘积最小的子数组

        int ret = 0;
        for (int i = 1; i <= n; i++) {
            if (nums[i-1] > 0) {
                f[i] = f[i-1] + 1;
                g[i] = g[i-1] == 0 ? 0 : g[i-1] + 1;
            } else if (nums[i-1] < 0){
                f[i] = g[i-1] == 0 ? 0 : g[i-1] + 1;
                g[i] = f[i-1] + 1;
            }
            ret = Math.max(ret,f[i]);
        }
        return ret;
    }
}
